Robust Negative Sampling for Network Embedding
نویسندگان
چکیده
منابع مشابه
Negative-Sampling Word-Embedding Method
The word2vec software of Tomas Mikolov and colleagues has gained a lot of traction lately, and provides state-of-the-art word embeddings. The learning models behind the software are described in two research papers [1, 2]. We found the description of the models in these papers to be somewhat cryptic and hard to follow. While the motivations and presentation may be obvious to the neural-networks...
متن کاملVertex-Context Sampling for Weighted Network Embedding
Network embedding methods have garnered increasing aention because of their eectiveness in various information retrieval tasks. e goal is to learn low-dimensional representations of vertexes in an information network and simultaneously capture and preserve the network structure. Critical to the performance of a network embedding method is how the edges/vertexes of the network is sampled for ...
متن کاملEnhancing Knowledge Graph Embedding with Probabilistic Negative Sampling
Link Prediction using Knowledge graph embedding projects symbolic entities and relations into low dimensional vector space, thereby learning the semantic relations between entities. Among various embedding models, there is a series of translation-based models such as TransE [1], TransH [2], and TransR[3]. This paper proposes modifications in the TransR model to address the issue of skewed data ...
متن کاملNetwork slice embedding under traffic uncertainties - A light robust approach
5G networks are conceived to be highly flexible and programmable end-to-end connect-and-compute infrastructures. In that context, the concept of network slicing is of particular importance [1]. From a network infrastructure point of view, network slicing refers to the provisioning and assignment of physical substrate network resources to tenants. To enable an efficient resource allocation, suit...
متن کاملConstructive sampling for patch-based embedding
To process high-dimensional big data, we assume that sufficiently small patches (or neighborhoods) of the data are approximately linear. These patches represent the tangent spaces of an underlying manifold structure from which we assume the data is sampled. We use these tangent spaces to extend the scalar relations that are used by many kernel methods to matrix relations, which encompass multid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33013191